Randomized Transmission Protocols for Protection against Jamming Attacks in Multi-Agent Consensus

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Transmission Protocols for Protection against Jamming Attacks in Multi-Agent Consensus

Multi-agent consensus under jamming attacks is investigated. Specifically, inter-agent communications over a network are assumed to fail at certain times due to jamming of transmissions by a malicious attacker. A new stochastic communication protocol is proposed to achieve finite-time practical consensus between agents. In this protocol, communication attempt times of agents are randomized and ...

متن کامل

Consensus of Multi-Agent Systems under the Special Consensus Protocols

Two consensus problems are considered in this paper. One is the consensus of linear multi-agent systems with weakly connected directed communication topology. The other is the consensus of nonlinear multi-agent systems with strongly connected directed communication topology. For the first problem, a simplified consensus protocol is designed: Each child agent can only communicate with one of its...

متن کامل

Randomized Optimal Consensus of Multi-agent Systems

In this paper, we formulate and solve a randomized optimal consensus problem for multiagent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem minz∈Rd ∑n i=1 fi(z), in which the optimal solution set of objective function fi corres...

متن کامل

Randomized Protocols for Asynchronous Consensus

One of the central problems in the Theory of (feasible) Computation is to ascertain to what extent, if any, randomization makes algorithms more powerful. This broad question is the motivation behind several very challenging open problems such as P ? = BPP– whether randomization expands the class of problems solvable in polynomial time– or NC ? = RNC– whether randomization helps to compute probl...

متن کامل

Distributed Consensus Protocols in Adaptive Multi-Agent Systems

The analysis of noisy consensus dynamics in networks is of great interest to both advance the fundamental understanding of multi-agent systems in nature as well as create robust decentralized engineering systems. We develop a protocol that heuristically attempts to optimize metrics of consensus dynamics without explicitly measuring a network’s global properties. Adopting the approach of utility...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2020

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2020.108960